A Parallel GRASP for MAX-SAT Problems
نویسندگان
چکیده
The weighted maximum satis ability MAX SAT problem is central in mathematical logic computing theory and many indus trial applications In this paper we present a parallel greedy randomized adaptive search procedure GRASP for solving MAX SAT problems Experimental results indicate that almost linear speedup is achieved
منابع مشابه
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
This paper describes Fortran subroutines for computing approximate solutions to the weighted MAX-SAT problem using a greedy randomized adaptive search procedure (GRASP). The algorithm [Resende, Pitsoulis, and Pardalos, 1997] is briefly outlined and its implementation is discussed. Usage of the subroutines is considered in detail. The subroutines are tested on a set of test problems, illustratin...
متن کاملBackbone Guided Local Search for the Weighted Maximum Satisfiability Problem
The Satisfiability problem (SAT) is a famous NP-Complete problem, which consists of an assignment of Boolean variables (true or false) and some clauses formed of these variables. A clause is a disjunction of some Boolean literals and can be true if and only if any of them is true. A SAT instance is satisfied if and only if all the clauses are simultaneously true. As a generalization of SAT, the...
متن کاملDiscrete Lagrangian-Based Search for Solving MAX-SAT Problems
Weighted maximum satissability problems (MAX-SAT) are diicult to solve due to the large number of local minima in their search space. In this paper we propose a new discrete Lagrangian based search method (DLM) for solving these problems. Instead of restarting from a new point when the search reaches a local minimum, the Lagrange multipliers in DLM provide a force to lead the search out of the ...
متن کاملGRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem
A GRASP with path-relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is described in this paper. GRASP, or Greedy Randomized Adaptive Search Procedure, is a randomized multi-start metaheuristic, where at each iteration locally optimal solutions are constructed, each independent of the others. Previous experimental results indicate its effective...
متن کاملComputing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants
Abstract geometrical computation can solve hard combinatorial problems efficiently: we showed previously how Q-SAT —the satisfiability problem of quantified boolean formulae— can be solved in bounded space and time using instance-specific signal machines and fractal parallelization. In this article, we propose an approach for constructing a particular generic machine for the same task. This mac...
متن کامل